|
General linear methods (GLMs) are a large class of numerical methods used to obtain numerical solutions to differential equations. This large class of methods in numerical analysis encompass multistage Runge–Kutta methods that use intermediate collocation points, as well as linear multistep methods that save a finite time history of the solution. John C. Butcher originally coined this term for these methods, and has written a series of review papers a book chapter and a textbook on the topic. His collaborator, Zdzislaw Jackiewicz also has an extensive textbook on the topic. The original class of methods were originally proposed by Butcher(1965), Gear (1965) and Gragg and Stetter (1964). == Some definitions == Numerical methods for first-order ordinary differential equations approximate solutions to initial value problems of the form : The result is approximations for the value of at discrete times : : where ''h'' is the time step (sometimes referred to as ). 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「General linear methods」の詳細全文を読む スポンサード リンク
|